Advice Complexity of the Online Search Problem
نویسندگان
چکیده
The online search problem is a fundamental problem in finance. The numerous direct applications include searching for optimal prices for commodity trading and trading foreign currencies. In this paper, we analyze the advice complexity of this problem. In particular, we are interested in identifying the minimum amount of information needed in order to achieve a certain competitive ratio. We design an algorithm that reads b bits of advice and achieves a competitive ratio of (M/m) +1) where M and m are the maximum and minimum price in the input. We also give a matching lower bound. Furthermore, we compare the power of advice and randomization for this problem.
منابع مشابه
Randomization Can Be as Helpful as a Glimpse of the Future in Online Computation
We provide simple but surprisingly useful direct product theorems for proving lower bounds on online algorithms with a limited amount of advice about the future. Intuitively, our direct product theorems say that if b bits of advice are needed to ensure a cost of at most t for some problem, then r · b bits of advice are needed to ensure a total cost of at most r · t when solving r independent in...
متن کاملThe String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity
The advice complexity of an online problem describes the additional information both necessary and sufficient for online algorithms to compute solutions of a certain quality. In this model, an oracle inspects the input before it is processed by an online algorithm. Depending on the input string, the oracle prepares an advice bit string that is accessed sequentially by the algorithm. The number ...
متن کاملOn the Advice Complexity of the Knapsack Problem
We study the advice complexity and the random bit complexity of the online knapsack problem: Given a knapsack of unit capacity, and n items that arrive in successive time steps, an online algorithm has to decide for every item whether it gets packed into the knapsack or not. The goal is to maximize the value of the items in the knapsack without exceeding its capacity. In the model of advice com...
متن کاملAdvice Complexity for a Class of Online Problems
The advice complexity of an online problem is a measure of how much knowledge of the future an online algorithm needs in order to achieve a certain competitive ratio. We determine the advice complexity of a number of hard online problems including independent set, vertex cover, dominating set and several others. These problems are hard, since a single wrong answer by the online algorithm can ha...
متن کاملOnline Makespan Scheduling with Sublinear Advice
Online algorithms are of importance for many practical applications. Typical examples involve scheduling and routing algorithms employed in operating systems and computer networks. Beside their practical significance, online algorithms are extensively studied from a theoretical point of view. Due to the nature of online problems, these algorithms fail to be optimal in general. The quality of th...
متن کامل